Modifications of the "central-method" to construct Steiner triple systems
نویسنده
چکیده
Let V with IV1 = v be a finite set and B a set of 3-subsets of V. The elements of V are called points, those of B lines. If any 2-subset of V is contained in exactly one line, then the pair (V, B) is called a Steiner triple system of order V, in short STS(u). Each point lies on exactly r = i(v 1) lines and we have JB1 = b = &(v 1). The condition v = 7, 9 + 6n, IZ E No, is necessary and sufficient for the existence of STS(u) (the trivial cases u = 1, u = 3 are excluded). The set of these “admissible” numbers, of these “Steiner numbers” is denoted by STS.
منابع مشابه
Identical twin Steiner triple systems
Two Steiner triple systems, each containing precisely one Pasch configuration which, when traded, switches one system to the other, are called twin Steiner triple systems. If the two systems are isomorphic the systems are called identical twins. Hitherto, identical twins were only known for orders 21, 27 and 33. In this paper we construct infinite families of identical twin Steiner triple systems.
متن کاملSelf-embeddings of doubled affine Steiner triple systems
Given a properly face two-coloured triangulation of the graph Kn in a surface, a Steiner triple system can be constructed from each of the colour classes. The two Steiner triple systems obtained in this manner are said to form a biembedding. If the systems are isomorphic to each other it is a self-embedding. In the following, for each k ≥ 2, we construct a self-embedding of the doubled affine S...
متن کاملA Catalogue of the Steiner Triple Systems of Order 19
A method for compressing Steiner triple systems is presented. This method has been used to compress the 11,084,874,829 Steiner triple systems of order 19 into approximately 39 gigabytes of memory. The compressed data can be obtained by contacting the authors.
متن کاملOrientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
We give a characterization of a current assignment on the bipartite Möbius ladder graph with 2n + 1 rungs. Such an assignment yields an index one current graph with current group Z12n+7 that generates an orientable face 2-colorable triangular embedding of the complete graph K12n+7 or, equivalently, an orientable biembedding of two cyclic Steiner triple systems of order 12n+7. We use our charact...
متن کاملIsomorphisms of Infinite Steiner Triple Systems II
A combinatorial method in conjuction with the results presented in [F] is introduced to prove that for any infinite cardinal κ, and every cardinal λ, 0≤λ≤κ, there are 2 mutually non-isomorphic Steiner triple systems of size κ that admit exactly 2 automorphisms. In particular, there are 2 mutually non-isomorphic rigid Steiner triple systems of size κ.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 77 شماره
صفحات -
تاریخ انتشار 1989